Average case complexity of DNFs and Shannon semi-effect for narrow subclasses of boolean functions
نویسندگان
چکیده
In this paper we establish some bounds on the complexity of disjunctive normal forms of boolean function from narrow subclasses (e.g. functions takes value 0 in a limited number of points). The bounds are obtained by reduction the initial problem to a simple set covering problem. The nature of the complexity bounds provided is tightly connected with Shannon effect and semi-effect for this classes.
منابع مشابه
Learning DNFs and Circuits Using Teaching Assistants
In this paper we consider the complexity of learning monotone DNF formulae and Boolean circuits in an exact learning model called the teaching assistant model. This model, introduced in one of our earlier works, uses teaching assistant classes for classifying learning problems. Teaching assistant classes are a learning-theoretic analog of complexity classes. We show that monotone DNFs are learn...
متن کاملLearning pseudo-Boolean k-DNF and submodular functions
We prove that any submodular function f : {0, 1}n → {0, 1, ..., k} can be represented as a pseudoBoolean 2k-DNF formula. Pseudo-Boolean DNFs are a natural generalization of DNF representation for functions with integer range. Each term in such a formula has an associated integral constant. We show that an analog of Håstad’s switching lemma holds for pseudo-Boolean k-DNFs if all constants associ...
متن کاملNo Shannon effect on probability distributions on Boolean functions induced by random expressions∗
The Shannon effect states that “almost all” Boolean functions have a complexity close to the maximal possible for the uniform probability distribution. In this paper we use some probability distributions on functions, induced by random expressions, and prove that this model does not exhibit the Shannon effect.
متن کاملOrdered binary decision diagrams and the Shannon effect
We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. It was known that for most values of n, the expected OBDD size of a random Boolean function with n variables is equal to the worst-case size up to terms of lower order. Such a phenomenon is generally called strong Shannon effect. Here we show that the strong Shannon effect is not vali...
متن کاملOn the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas
It is a wellknown fact that the satisfiability problem (SAT) for Boolean formulas in a conjunctive normal form (CNF) is NP complete, i.e. Σ1 complete. It is also known that the decision version of Boolean minimization for CNF inputs is Σ2 complete. On the other hand there are several subclasses of CNFs (e.g. Horn CNFs) for which SAT is known to be in P = Σ0 while the minimization problem is Σ1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1501.03444 شماره
صفحات -
تاریخ انتشار 2015